做好奥运出入境边防检查工作之管见

确保奥运会安全、顺利、成功举办，是当前压倒一切的政治任务，全国边防检查机关广大官兵要提高思想认识，加强组织领导，加大各项工作力度，真正做到“服务更加亲切，管控更加严密”，推动边检服务工作再上新台阶。     

基于可视化仿真的高炮系统服务概率分析技术

服务概率是高炮系统作战效能的一个重要指标,同时也是合理配置防空兵器的重要参考依据。以排队论为基础的高炮系统服务概率数学模型及数值仿真技术已经比较成熟,但是其仿真过程不够直观形象。通过数据传递,在数值仿真的基础上建立了视景仿真系统,分析了系统的整体框架以及工作流程。在基于Unity3D的三维视景环境中,以真实的仿真数据来驱动模型运动,实现了目标航迹模拟以及目标信息的实时获取,再现了高炮系统的服务过程与射击效果,为高炮系统作战效能评估提供重要参考。     

推进广东省现役制边检站科学发展的几点思考

随着国家改革开放政策的逐步深入,广东省现役制边防检查站的发展面临着新的机遇和挑战。要从完善政策法规、落实服务定式、合理整合资源、推动执法规范化建设、加强业务培训、实施科技强警等方面入手,着力解决供给保障、形象地位、机构设置、队伍素质、执法水平、顺应形势等问题,全力推进广东省现役制边防检查站科学发展。     

谈新闻媒体对警卫工作的影响

警卫工作与新闻媒体有着广泛的联系，新闻媒体对警卫工作具有重大影响，警卫部门要科学利用新闻媒体，充分发挥其积极作用。     

面向服务的遗留系统再工程过程

将遗留系统再工程为面向服务系统是软件技术发展的趋势,但现有软件过程不能很好地解决面向服务的再工程所面临的问题.比如如何协调遗留系统共利益者的交流并快速有效地处理需求变更;如何实现服务以满足目标系统体系结构灵活性;如何降低重用遗留系统带来的风险以及如何减少交付期的软件错误等.针对这些问题,设计了面向服务的遗留系统再工程过程(SORP).SORP融合了传统软件过程的计划性和灵活性,并根据面向服务再工程项目的特点进行了特殊配置,在生命周期上将再工程过程划分为四个阶段,在内容上包含了六个工作流.为与实践相结合,详细规划了SORP的角色、活动、工作产品以及评估方法.应用实践表明,SORP在一定程度上增加了目标系统体系结构的灵活性,降低了重用遗留系统带来的风险.     

Analysis of a finite‐buffer bulk‐service queue with discrete‐Markovian arrival process: D‐MAP/Ga,b/1/N

Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003.     

The stochastic single resource service‐provision problem

The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Many‐server loss models with non‐poisson time‐varying arrivals

This article proposes an approximation for the blocking probability in a many‐server loss model with a non‐Poisson time‐varying arrival process and flexible staffing (number of servers) and shows that it can be used to set staffing levels to stabilize the time‐varying blocking probability at a target level. Because the blocking probabilities necessarily change dramatically after each staffing change, we randomize the time of each staffing change about the planned time. We apply simulation to show that (i) the blocking probabilities cannot be stabilized without some form of randomization, (ii) the new staffing algorithm with randomiation can stabilize blocking probabilities at target levels and (iii) the required staffing can be quite different when the Poisson assumption is dropped. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 177–202, 2017     

综合环网通信协议的研究

本文根据LAN(局域网络)的现状和发展趋势的讨论,指出光纤环网是未来综合业务局网的优选网络,提出了适合于ISRN(综合业务环网)中综合业务交换的帧结构,给出了ISRN中的通信协议的分层描述,提出了实现边界移动的方法,实现了以信令格式和边界可动策略为基础的信令处理软件。     

基于灰度关联和神经网络的装备价格第三方服务机构评价模型

为了科学合理选择装备价格第三方服务机构,研究以灰度关联分析和神经网络方法构建评价模型。研究数据采用问卷调研形式获取,针对样本数据采用灰度关联法分析评价指标与综合评分之间的关联性,发现服务态度和制度建设情况两个评价指标与综合评分关联度达0.74以上,较为重要。采用有效二级指标和综合评分作为输入和输出数据,构建基于神经网络的装备价格第三方服务机构评价模型。通过实际数据验证分析,发现神经网络模型预测精准的概率为75%,预测满足要求的概率为25%,满足实际应用需求,能够为主管部门遴选机构建言献策。